Performance Analysis of Routing Algorithms for Optical Burst Switching

In this paper we study the performance of several routing algorithms for optical burst switching network. The main aim is to find ways for performing dynamic load balancing and reduce congestion situation. In our analysis, we consider a common network scenario and, as a performance reference, we use the simple shortest path routing giving results of both analytical and simulation models. Therefore we propose many different routing algorithms based either on adaptive or non-adaptive strategies as well as distributed or isolated path selection. The obtained results highlight that none of the proposed strategies improve significantly the performance over the simple shortest path approach in the considered scenarios.